public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root =  binaryTree.createTree();

        /* binaryTree.prevOrder(root);
        System.out.println();
        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.postOrder(root);
        System.out.println();

        System.out.println(binaryTree.size(root));

        System.out.println(binaryTree.rootsize(root));

        System.out.println(binaryTree.getKLevelNodeCount(root,3));

        System.out.println(binaryTree.getHigh(root));

        System.out.println(binaryTree.find(root,'j'));

        binaryTree.levelOrder(root);

        System.out.println(binaryTree.isCompleteTree(root));*/

        binaryTree.prOrder(root);
        System.out.println();
        binaryTree.inOrderNor(root);
        System.out.println();
        binaryTree.postOrderNor(root);
        System.out.println();
        binaryTree.postOrder(root);
        System.out.println();
    }
}
